Higher Order Process-Algebraic Axiomatizations of Statecharts Variants
نویسنده
چکیده
Axiomatizations are given for some prominent variants of the semantics of the statecharts formalism. The axiomatizations highlight the similarities and di erences amongst the semantics. In particular, all the semantics rely on the same notion of \microstep", but di erent notions of \step sequence". A process-algebraic approach is taken, and an executable variety of higher order logic is used, allowing test runs to be performed concerning the e ects of the semantics. It is shown that the higher order logic setting facilitates the addition of complex features not previously studied in process-algebraic approaches, including state-exiting transitions and history transitions. Other desirable features are also added, such as state name scoping.
منابع مشابه
Fully-Abstract Statecharts Semantics via Intuitionistic Kripke Models
The semantics of Statecharts macro steps, as introduced by Pnueli and Shalev, lacks compositionality. This paper rst analyzes the compositionality problem and traces it back to the invalidity of the Law of the Excluded Middle. It then characterizes the semantics via a particular class of linear, intuitionistic Kripke models, namely stabilization sequences. This yields, for the rst time in the l...
متن کاملExploiting Algebraic Laws to Improve Mechanized Axiomatizations
In the field of structural operational semantics (SOS), there have been several proposals both for syntactic rule formats guaranteeing the validity of algebraic laws, and for algorithms for automatically generating ground-complete axiomatizations. However, there has been no synergy between these two types of results. This paper takes the first steps in marrying these two areas of research in th...
متن کاملA Process Algebraic Semantics for Statecharts via State Refinement
We give a formal semantics for statecharts via a translation into a process algebra with state reenement, a new operator for capturing hierarchy in concurrent systems. Our main technical result can be stated as follows. Let A be a statechart automaton as deened by the operational model of A. Pnueli and M. Shalev, What is in a step: On the semantics of statecharts, LNCS number 526, 1991], and le...
متن کاملInteractive Verification of Statecharts
This paper presents an approach to the integration of statecharts, temporal logic and algebraic specification within an interactive verification environment. Currently some integrated formalisms exist [13, 7], but there is no proof support for theses approaches. Also model checkers are able to prove temporal properties of statecharts [3, 10], but they can only be used to verify properties based...
متن کاملImpossibility Results in the Equational Logic of Processes
This talk offers a survey of negative results on the existence of finite equational axiomatizations for bisimulation equivalence over fragments of algebraic process calculi.
متن کامل